On the Complexity of Boolean Uni cationFranz

نویسنده

  • Franz Baader
چکیده

Uniication modulo the theory of Boolean algebras has been investigated by several autors. Nevertheless, the exact complexity of the decision problem for uniication with constants and general uniication was not known. In this research note, we show that the decision problem is p 2-complete for uniication with constants and PSPACE-complete for general uniication. In contrast, the decision problem for elementary uniication (where the terms to be uniied contain only symbols of the signature of Boolean algebras) is \only" NP-complete.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Filter theory in MTL-algebras based on Uni-soft property

‎The notion of (Boolean) uni-soft filters‎ ‎in MTL-algebras is introduced‎, ‎and several properties of them are‎ ‎investigated‎. ‎Characterizations of (Boolean) uni-soft filters are discussed‎, ‎and some (necessary and sufficient) conditions‎ ‎for a uni-soft filter to be Boolean are provided‎. ‎The condensational property for a Boolean uni-soft filter is established.

متن کامل

A Study on the Altruistic Attitude among the Youth in Mashhad

The aim of this research is to study altruism among the youth and is applied by the method of grounded theory. The focus of study is on exploring the social process which shapes altruism. The data were gathered through in-depth interviews 10 youth who lived in Mashhad. The results of the study highlight the complexity and variety of the youth experiences altruism that is a process reflects inte...

متن کامل

Developing a Filter-Wrapper Feature Selection Method and its Application in Dimension Reduction of Gen Expression

Nowadays, increasing the volume of data and the number of attributes in the dataset has reduced the accuracy of the learning algorithm and the computational complexity. A dimensionality reduction method is a feature selection method, which is done through filtering and wrapping. The wrapper methods are more accurate than filter ones but perform faster and have a less computational burden. With ...

متن کامل

The Effect of Task Sequencing on the Writing Fluency of English as Foreign Language Learners

This study investigated the effect of sequencing tasks from simple to complex along +/- reasoning demands on fluency in writing task performance of English as Foreign Language (EFL) learners. The participants of this study included 90 intermediate EFL learners from three intact class divisions at the Islamic Azad Uni- versity, Shahr-e-Qods Branch. They were distributed in three groups: Experime...

متن کامل

ON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES

Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997